Unsupervised Open Relation Extraction
نویسندگان
چکیده
We explore methods to extract relations between named entities from free text in an unsupervised setting. In addition to standard feature extraction, we develop a novel method to re-weight word embeddings. We alleviate the problem of features sparsity using an individual feature reduction. Our approach exhibits a significant improvement by 5.8% over the state-of-the-art relation clustering scoring a F1-score of 0.416 on the NYT-FB dataset.
منابع مشابه
Towards Large-Scale Unsupervised Relation Extraction from the Web
The Web brings an open-ended set of semantic relations. Discovering the significant types is very challenging. Unsupervised algorithms have been developed to extract relations from a corpus without knowing the relation types in advance, but most of them rely on tagging arguments of predefined types. One recently reported system is able to jointly extract relations and their argument semantic cl...
متن کاملThe Effectiveness of Traditional and Open Relation Extraction for the Slot Filling Task at TAC 2011
Our goal in this paper is to investigate the effectiveness of relation extraction techniques for the slot-filling task. We discuss two relation extraction systems. YRES follows the traditional paradigm in relation extraction, where a system takes advantage of available examples for each relation to be extracted. On the other hand, SONEX follows the open relation extraction paradigm, where the r...
متن کاملEvaluation of Unsupervised Information Extraction
Unsupervised methods gain more and more attention nowadays in information extraction area, which allows to design more open extraction systems. In the domain of unsupervised information extraction, clustering methods are of particular importance. However, evaluating the results of clustering remains difficult at a large scale, especially in the absence of a reliable reference. On the basis of o...
متن کاملEnsemble Semantics for Large-scale Unsupervised Relation Extraction
Discovering significant types of relations from the web is challenging because of its open nature. Unsupervised algorithms are developed to extract relations from a corpus without knowing the relations in advance, but most of them rely on tagging arguments of predefined types. Recently, a new algorithm was proposed to jointly extract relations and their argument semantic classes, taking a set o...
متن کاملUnsupervised Lexicon Acquisition for HPSG-Based Relation Extraction
The paper describes a method of relation extraction , which is based on parsing the input text using a combination of a generic HPSG-based grammar and a highly focused domain-and relation-specific lexicon. We also show a method of unsupervised acquisition of such a lexicon from a large unla-beled corpus. Together, the methods introduce a novel approach to the " Open IE " task, which is superior...
متن کاملx.ent: R Package for Entities and Relations Extraction based on Unsupervised Learning and Document Structure
Relation extraction with accurate precision is still a challenge when processing full text databases. We propose an approach based on cooccurrence analysis in each document for which we used document organization to improve accuracy of relation extraction. This approach is implemented in a R package called x.ent. Another facet of extraction relies on use of extracted relation into a querying sy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017